A modular reasoning system using uninterpreted predicates for code reuse
نویسندگان
چکیده
منابع مشابه
A modular reasoning system using uninterpreted predicates for code reuse
This paper proposes a modular proof system based on uninterpreted predicates. The proposed proof system allows modular reasoning about programs with an open-world assumption, which goes beyond behavioral subtyping. The proof system enables modular reasoning about languages with very flexible code reuse mechanisms, such as traits and deltas in the context of object-oriented programming. Whereas ...
متن کاملInheritance: from code reuse to reasoning reuse
In the Object-Oriented approach a designer can, given an existing base class, use inheritance to build a derived class that extends, or that slightly differs from the base class. But in order to exploit the full potential of inheritance to build systems incrementally, the designer must also be able to reason about the derived class incrementally. This paper presents a specification notation and...
متن کاملA Behavioural Algebraic Framework for Modular System Design with Reuse
A formal framework for the design of modular software systems is presented which incorporates the idea of reusing software components in new applications. The approach is based on structured algebraic specifications with behavioural semantics. In a first step, syntax and semantics of structured behavioural specifications are introduced. Then, in order to provide a clean interconnection mechanis...
متن کاملA Direct Power Feeding System for AC Railway Networks Using Modular Multilevel Converter
Abstract Traditional railway power supply systems impose substantial power quality problems (PQ) on the utility network, such as unbalance, harmonics and a large amount of reactive power. This paper proposes a topology based on three-phase to single-phase modular multilevel converters (MMC) to obviate these problems. The MMC based traction substations (TSS) are connected directly to the utili...
متن کاملAdding modular predicates
This paper is a contribution to the study of regular languages defined by fragments of first order or even monadic second order logic. More specifically, we consider the operation of enriching a given fragment by adding modular predicates. Our first result gives a simple algebraic counterpart to this operation in terms of semidirect products of varieties together with a combinatorial descriptio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logical and Algebraic Methods in Programming
سال: 2018
ISSN: 2352-2208
DOI: 10.1016/j.jlamp.2017.11.004